منابع مشابه
Locally ̂ - Equivalent Algebras ^ )
Let A be a Banach "-algebra. A is locally ¿"-equivalent if, for every selfadjoint element t e A, the closed *-subalgebra of A generated by / is *-isomorphic to a ¿"-algebra. In this paper it is shown that when A is locally ¿"-equivalent, and in addition every selfadjoint element in A has at most countable spectrum, then A is *-isomorphic to a ¿"-algebra.
متن کاملAn efficient algorithm to recognize locally equivalent graphs
There are local operators on (labeled) graphs G with labels (gij) in a finite field. If the field is binary, the operations are just the local complementations, but in the general case, there are two different types of operators. For the first type, let v be a vertex of the graph and a ∈ Fq, and we obtain a graph with labels g ′ ij = gij+agvigvj . For the second type of operators, let 0 6= b ∈ ...
متن کاملAlignment Correspondences
φ : R→̃ÔX,p with φ(I1, . . . , Ir) = (a1, . . . , ar)} and its closure C(I1, . . . , Ir) in the appropriate product of Hilbert schemes. If the ideals Ij are monomial, we will say that the space C(I1, . . . , Ir) is an alignment correspondenceswith interior U(I1, . . . , Ir). The significance of the Ij’s being monomial is that in this case we can show that the space U(I1, . . . , Ir) in most case...
متن کاملA heuristic procedure for the detection of locally similar substructures of two equivalent structures.
A heuristic procedure is presented for the detection of locally similar substructures in two equivalent molecules, using elementary graph theoretical concepts. The capabilities of the procedure are demonstrated on the comparison of the calmodulin backbone in the X-ray structure and in a structure obtained from molecular dynamics.
متن کاملAn Efficient Algorithm to Recognize Locally Equivalent Graphs in Non-Binary Case
Let v be a vertex of a graph G. By the local complementation of G at v we mean to complement the subgraph induced by the neighbors of v. This operator can be generalized as follows. Assume that, each edge of G has a label in the finite field Fq. Let (gij) be set of labels (gij is the label of edge ij). We define two types of operators. For the first one, let v be a vertex of G and a ∈ Fq, and o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’institut Fourier
سال: 2017
ISSN: 0373-0956,1777-5310
DOI: 10.5802/aif.3088